An Efficient Recursive Transition Network Parser for Arabic Language

Parsing Arabic sentences is a difficult task; the difficulties come from several sources. One is that sentences are long and complex, the other difficulties come from the sentence structure. The syntactic structure of sentence parts may be missing, taking different orders of words and phrases. The present work aims to develop an Arabic Parser. A new parser has been developed with the aim of analyzing and extracting the attributes of Arabic words. The parser has been written using top-down algorithm parsing technique with recursive transition network, the parser development was a two-step process. In the first step, the set of rules used in the study for Arabic parser have been generated from an existing Arabic text taught in k-12 grade levels. The second step was the implementation of the parser which analyses an Arabic sentence and determines if the sentence follows a valid grammatical structure. The parser has been evaluated against real sentences and the outcomes were very satisfactory.